Перевод: с английского на все языки

со всех языков на английский

two-way infinite sequence

См. также в других словарях:

  • Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length …   Wikipedia

  • Infinite monkey theorem — Not to be confused with Hundredth monkey effect. Given enough time, a hypothetical monkey typing at random would, as part of its output, almost surely produce all of Shakespeare s plays. In this image a chimpanzee is giving it a try. The infinite …   Wikipedia

  • Infinite regress — An infinite regress in a series of propositions arises if the truth of proposition P 1 requires the support of proposition P 2, and for any proposition in the series P n , the truth of P n requires the support of the truth of P n +1. There would… …   Wikipedia

  • Infinite descent — In mathematics, a proof by infinite descent is a particular kind of proof by contradiction which relies on the fact that the natural numbers are well ordered. One typical application is to show that a given equation has no solutions. Assuming a… …   Wikipedia

  • Two envelopes problem — The two envelopes problem is a puzzle or paradox within the subjectivistic interpretation of probability theory; more specifically within Bayesian decision theory. This is still an open problem among the subjectivists as no consensus has been… …   Wikipedia

  • Infinite loop — This article is about the programming term. For the street on which Apple Inc. s campus is located, see Infinite Loop (street). An infinite loop (also known as an endless loop) is a sequence of instructions in a computer program which loops… …   Wikipedia

  • Two Generals' Problem — In computing, the Two Generals Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. It is related to the more general Byzantine… …   Wikipedia

  • Low-discrepancy sequence — In mathematics, a low discrepancy sequence is a sequence with the property that for all values of N , its subsequence x 1, ..., x N has a low discrepancy.Roughly speaking, the discrepancy of a sequence is low if the number of points in the… …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • Post–Turing machine — The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines. A Post–Turing machine is a program formulation of an especially simple type of Turing machine, comprising a …   Wikipedia

  • Sylvester's sequence — In number theory, Sylvester s sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are::2, 3, 7, 43, 1807, 3263443, 10650056950807,… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»